منابع مشابه
Variable resolution triangulations
A comprehensive study of multiresolution decompositions of planar domains into triangles is given. A model introduced that is more general than other multiresolution models proposed in the literature. The model is based on a collection of fragments of plane triangulations arranged into a partially ordered set. Diierent decompositions of a domain can be obtained by combining diierent fragments f...
متن کاملVariable Resolution Hierarchical RL
The contribution of this paper is to introduce heuristics, that go beyond safe state abstraction in hierarchical reinforcement learning, to approximate a decomposed value function. Additional improvements in time and space complexity for learning and execution may outweigh achieving less than hierarchically optimal performance and deliver anytime decision making during execution. Heuristics are...
متن کاملVariable Resolution Particle Filter
Particle filters are used extensively for tracking the state of non-linear dynamic systems. This paper presents a new particle filter that maintains samples in the state space at dynamically varying resolution for computational efficiency. Resolution within statespace varies by region, depending on the belief that the true state lies within each region. Where belief is strong, resolution is fin...
متن کاملVariable Spatial Resolution: Quadtrees
The concept of variable spatial resolution implies varying sized units at a given resolution level. The choise of the shape is a special matter. The square is particular handy if the process of creating the blocks of varying size is one of the decomposing space from a general level to more detail. For example, a polygon can be successively approximated by sets of blocks at different levels: If ...
متن کاملVariable Resolution A*
We argue that A*, the popular technique for path-finding for NPCs in games, suffers from three problems that are pertinent to game worlds: (a) the grid maps often restrict the optimality of the paths, (b) A* paths exhibit wall-hugging behavior, and (c) optimal paths are more predictable. We present a new algorithm, VRA*, that varies map-resolution as needed, and repeatedly calls A*. We also pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1998
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(98)00029-7